Interdiction problems on planar graphs

Interdiction Problems on Planar Graphs

We introduce approximation algorithms and strong NP-completeness results for interdiction problems on planar graphs. Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We give a multiplicative (1+ǫ)-approxi...

Network flow interdiction on planar graphs

Extensions to Network Flow Interdiction on Planar Graphs

Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general networks, pseudo-polynomial algorithms were found for planar networks with a single source and a single sink and without the possibility to remove vertices. In ...

Experiments on Optimally Solving NP-complete Problems on Planar Graphs

Symmetric Interdiction for Matching Problems

Motivated by denial-of-service network attacks, we introduce the symmetric interdiction model, where both the interdictor and the optimizer are subject to the same constraints of the underlying optimization problem. We give a general framework that relates optimization to symmetric interdiction for a broad class of optimization problems. We then study the symmetric matching interdiction problem...